Efficient Ranking and Selection in Parallel Computing Environments
نویسندگان
چکیده
منابع مشابه
Efficient Ranking and Selection in Parallel Computing Environments
The goal of ranking and selection (R&S) procedures is to identify the best stochastic system from among a finite set of competing alternatives. Such procedures require constructing estimates of each system’s performance, which can be obtained simultaneously by running multiple independent replications on a parallel computing platform. However, nontrivial statistical and implementation issues ar...
متن کاملFully Sequential Procedures for Large-Scale Ranking-and-Selection Problems in Parallel Computing Environments
Fully sequential ranking-and-selection (R&S) procedures to find the best from a finite set of simulated alternatives are often designed to be implemented on a single processor. However, parallel computing environments, such as multi-core personal computers and many-core servers, are becoming ubiquitous and easily accessible for ordinary users. In this paper, we propose two types of fully sequen...
متن کاملParallel Ranking and Selection
The Winter Simulation Conference serves as the initial publication venue for many advances in ranking and selection (R&S), including the recently-developed R&S procedures that exploit high-performance parallel computing. We formulate a new stylized model for representing parallel R&S procedures, and we provide an overview of existing R&S procedures under the stylized model. We also discuss why ...
متن کاملParallel Computing Environments and Methods
Recent advances in high-speed networks, rapid improvements in microprocessor design, and availability of highly performing clustering software implementations enables cost-effective high-performance parallel computing on clustered low cost workstations and PCs. Such clusters are very attractive because they rely on available of the shelf hardware and software technologies. To simpha programming...
متن کاملEfficient Parallel Query Processing by Graph Ranking
In this paper we deal with the problem of finding an optimal query execution plan in database systems. We improve the analysis of a polynomial-time approximation algorithm due to Makino et al. for designing query execution plans with almost optimal number of parallel steps. This algorithm is based on the concept of edge ranking of graphs. We use a new upper bound for the edge ranking number of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Operations Research
سال: 2017
ISSN: 0030-364X,1526-5463
DOI: 10.1287/opre.2016.1577